package top.humbleyuan.test.demo;

import top.humbleyuan.leet.datastructure.tree.TreeNode;

import java.util.LinkedList;
import java.util.Queue;

/**
 * @Author HumbleYuan
 * @Date 2020/4/21 21:38
 * @Des
 */
public class T2 {
    /**
     *
     * @param args
     */
    public static void main(String[] args) {
        TreeNode tree = new TreeNode(1);

        Queue<TreeNode> queue = new LinkedList<>();

        while (!queue.isEmpty()) {
            TreeNode t = queue.poll();

            Queue<TreeNode> cur = new LinkedList<>();
            while (!cur.isEmpty()) {

            }
        }
    }
}
